Linear Approximation of Execution-Time Constraints

On the Approximation of Pseudo Linear Systems by Linear Time Varying Systems (RESEARCH NOTE)

This paper presents a modified method for approximating nonlinear systems by a sequence of linear time varying systems. The convergence proof is outlined and the potential of this methodology is discussed. Simulation results are used to show the effectiveness of the proposed method.

Smooth Linear Approximation of Non-overlap Constraints

Constraint-based placement tools and their use in diagramming tools has been investigated for decades. One of the most important and natural placement constraints in diagrams is that their graphic elements do not overlap. However, non-overlap of objects, especially nonconvex objects, is extremely difficult to solve, especially to solve sufficiently rapidly for direct manipulation. Here we prese...

Fault-Tolerant Real-Time Scheduling under Execution Time Constraints

The primary backup with deallocation approach of is a strategy for the fault tolerant online scheduling of hard real time tasks In this scheme tasks are either rejected within a short time after the request or guaranteed to be executed even in case of a processor failure In this paper several heuristics for the guarantee algorithm are investigated For the rst time di erent processor selection s...

Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems

The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler’s admission tests and subsequently limits a task’s execution time during operation. If a task exceeds the WCET, this situation is detected and either a handler is invoked or control is transferred to a human operator. Such control systems usually...

Linear time approximation of 3D convex polytopes